Bytecode (also called portable code or p-code) is a form of instruction set designed for efficient execution by a software interpreter. Unlike human-readable source code, bytecodes are compact numeric codes, constants, and references (normally numeric addresses) that encode the result of compiler parsing and performing semantic analysis of things like type, scope, and nesting depths of program objects.

<programming, tool> A compiler which outputs a program in some kind of byte-code. Compare: byte-code interpreter. (1995-11-04)

intermediate language

<file format, software> A binary file containing an executable program, consisting of a sequence of (op code, data) pairs. Byte-code op codes are most often fixed size binary patterns, but can be variable size. The data portion consists of zero or more bits whose format typically depends on the op code. A byte-code program is interpreted by a {byte-code interpreter}. The advantage of this technique compared with outputing machine code for some particular processor is that the same byte-code can be executed on any processor on which the byte-code interpreter runs. The byte-code may be compiled to machine code ("native code") for speed of execution but this usually requires significantly greater effort for each new taraget architecture than simply porting the interpreter. For example, Java is compiled to byte-code which runs on the Java Virtual Machine. (2006-05-29)

<language> The intermediate language produced by the Pascal-P compiler. P-code is the assembly language for a hypothetical stack machine, the P-machine, said to imitate the instruction set of the Burroughs 6700. The term was first used in the Wirth reference below. Byte articles on writing a Pascal Compiler in Northstar BASIC (ca Aug 1978) also used the term. P-code was initially the intermediate code generated by the P2 compiler from ETH Zurich. P-code was later used as the intermediate language in the UCSD Pascal System, and in its two main derivatives, Apple Pascal and the UCSD P-system. Variants: P2 P-code, P4 P-code, UCSD P-code, LASL P-code. [Algorithms + Data Structures = Programs, N. Wirth, P-H 1976]. ["A Comparison of PASCAL Intermediate Languages", P.A. Nelson, SIGPLAN Notices 14(8):208-213, Aug 1979]. (2004-11-08)

In computing, Java bytecode is the bytecode-structured instruction set of the Java virtual machine (JVM), a virtual machine that enables a computer to run programs written in the Java programming language and several other programming languages, see List of JVM languages.

This is a list of the instructions that make up the Java bytecode, an abstract machine language that is ultimately executed by the Java virtual machine. The Java bytecode is generated from languages running on the Java Platform, most notably the Java programming language.

<language> A superset of Oberon-1, developed by H. Moessenboeck in 1991 to add object-orientation. Oberon-2 was a redesign of Object Oberon. It included type-bound procedures (equivalent to methods), read-only export of variables and record fields, open array variables, and a "with" statement with variants. It reintroduced the "for" statement. There is an Oberon-2 Lex scanner and Yacc parser by Stephen J Bevan of Manchester University, UK, based on the one in the Mo"ssenbo"ck and Wirth reference. Version 1.4. ftp://neptune.inf.ethz.ch/Oberon/. ftp://ftp.psg.com/pub/oberon/. ["The Programming Language Oberon-2", H. Mo"ssenbo"ck, N. Wirth, Institut fu"r Computersysteme, ETH Zu"rich, January 1992]. ["Second International Modula-2 Conference", Sept 1991]. (1992-07-06)

Application virtualization software refers to both application virtual machines and software responsible for implementing them. Application virtual machines are typically used to allow application bytecode to run portably on many different computer architectures and operating systems.

<theory> Geoff Burn defines evaluators E0, E1, E2 and E3 which when applied to an expression, reduce it to varying degrees. E0 does no evaluation, E1 it evaluates to {weak head normal form} (WHNF), E2 evaluates the structure of a list, i.e. it evaluates it either to NIL or evaluates it to a CONS and then applies E2 to the second argument of the CONS. E3 evaluates the structure of a list and evaluates each element of the list to WHNF. This concept can be extended to data structures other than lists and forms the basis of the {evaluation transformer} style of strictness analysis. (1994-12-12)